package ACWing.Dynamicprogramming;
//900. 整数划分
import java.util.Scanner;

/**
 * @author :chenjie
 * @date :Created 2022/11/16 0:29
 */

public class IntegerDivision {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int mod= (int) (1.0E9+7);
        int n=sc.nextInt();
        int[]dp=new int[1010];
        dp[0]=1;
        for (int i = 1; i < n+1; i++) {
            for (int j = i; j<n+1; j++) {
                    dp[j]=(dp[j]+dp[j-i])%mod;//看成完全背包问题
            }

        }
        System.out.println(dp[n]);
    }
}
